Connectivity-based multiple-circle fitting
نویسندگان
چکیده
This paper proposes a connectivity-based method for circle $tting. The use of pixel connectivity e3ectively avoids false circle detection, improves the robustness against noise and signi$cantly reduces the computational load. The desired circular models are extracted by searching for meaningful circular arcs. The algorithm does not require a good initial guess, and is e3ective for extracting an a priori unknown number of circles even when the number of outliers exceeds 50%. The experimental results demonstrate that the proposed method performs well in detecting multiple intersecting or occluded circles. ? 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
منابع مشابه
Multiple ellipse fitting by center-based clustering
This paper deals with the multiple ellipse fitting problem based on a given set of data points in a plane. The presumption is that all data points are derived from k ellipses that should be fitted. The problem is solved by means of center-based clustering, where cluster centers are ellipses. If the Mahalanobis distance-like function is introduced in each cluster, then the cluster center is repr...
متن کاملFunctional connectivity analysis of fMRI data using parameterized regions-of-interest
Connectivity analysis of fMRI data requires correct specification of regions-of-interest (ROIs). Selection of ROIs based on outcomes of a GLM analysis may be hindered by conservativeness of the multiple comparison correction, while selection based on brain anatomy may be biased due to inconsistent structure-to-function mapping. To alleviate these problems we propose a method to define functiona...
متن کاملMulti-Class Model Fitting by Energy Minimization and Mode-Seeking
We propose a general formulation, called Multi-X, for multi-class multi-instance model fitting – the problem of interpreting the input data as a mixture of noisy observations originating from multiple instances of multiple classes. We extend the commonly used α-expansion-based technique with a new move in the label space. The move replaces a set of labels with the corresponding density mode in ...
متن کاملENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملError analysis for circle fitting algorithms
We study the problem of fitting circles (or circular arcs) to data points observed with errors in both variables. A detailed error analysis for all popular circle fitting methods – geometric fit, K̊asa fit, Pratt fit, and Taubin fit – is presented. Our error analysis goes deeper than the traditional expansion to the leading order. We obtain higher order terms, which show exactly why and by how m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 37 شماره
صفحات -
تاریخ انتشار 2004